t1=int(input())
for i in range(t1):
x=str(input())
if len(x)<4:
p=int(x[-1])-1
l=(p*10)
if len(x)==1:
l+=1
if len(x)==2:
l+=3
if len(x)==3:
l+=6
print(l)
else:
p=int(x[-1])
l=p*10
print(l)
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
void solve(vector<int>& v)
{
for(int i=1;i<=9;i++)
{
int n=i;
while(n<=10000)
{
v.push_back(n);
n*=10;
n+=i;
}
}
}
//length of number
int countDigit(int n) {
return floor(log10(n) + 1);
}
int main() {
//pre array
vector<int> v;
solve(v);
// for(int i=0;i<v.size();i++)
// cout<<v[i]<<endl;
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
int count=0;
int i=0;
for(i;v[i]!=n;i++){
// { cout<<v[i]<<" ";
// cout<<"ans"<<endl;
count+=countDigit(v[i]);
}
if(v[i]==n)
count+=countDigit(v[i]);
// cout<<endl;
cout<<count<<endl;
}
return 0;
}791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |